Line coding scheme for digital communications, transmission method and apparatus

ABSTRACT

A coding scheme of order n for digital communications, in particular optical communication, for obtaining a coded signal x(t) which represents binary data which are constituted by sequences of information bits {u k } with rate T, the scheme having N=2 n  states, named Σ i , for i=1, 2, . . . , N, and comprising predetermined elementary signals s i (t) which are combined in the signal x(t). According to the scheme, if, at the time t=kT, the coding is in a state Σ m  of the N states, the arrival of the information bit u k  of the sequence {u k } forces a transition to the state Σ q  of the N states and the selection of the elementary signal s i (t) as x(t), where q and i are given by the following equations: d i =m−1mod2; d o =d 1 +u k mod2;y=2(m−1)+d;q=(rmodN)+1; and i=r+1 if r&lt;N, or i=r−2N otherwise.

[0001] The present invention relates to the field of encoding data for serial transmission in a transmission means, and is particularly applicable, but not limited, to the field of the optical communication systems.

[0002] Optical communications systems are a substantial and fast-growing constituent of communication networks. The expression “optical communication system”, as used herein, relates to any system which uses optical signals to convey information. Such optical systems include, but are not limited to, telecommunications systems, cable television systems, and local area networks (LANs). Optical communication systems are configured to carry information in modulated beams of light carried over optical fibres. However, the optical fibres in use today have characteristics that limit the speed and distance of data transmission.

[0003] A dispersive fibre broadens an input pulse causing intersymbol interference at the receiver and limiting, for a prefixed data rate, the maximum connection distance. As this effect is due to the non-linear shape of the fibre phase response around the optical carrier frequency, a signal with a narrower bandwidth should suffer less from chromatic dispersion. A way to reduce the signal bandwidth is line coding, and one proposed candidate is the duobinary code.

[0004] Duobinary is a widely used code scheme in which a “0” (“zero”) bit is represented by a zero-level electric current or voltage and a “1” (“one”) bit is represented by a positive-level current or voltage if the quantity of “0” bits since the last “1” bit is even, and by a negative-level current or voltage if the quantity of “0” bits since the last “1” bit is odd. This logic can be reversed, exchanging the words “bits 0” and “bits 1” in the above discussion. Recently other line coding schemes, called Phrased Amplitude-Shift Siginalling (PASS) codes and based on a modification of the duobinary one, have been proposed by Stark et al. in “Line coding for dispersion tolerance and spectral efficiency: duobinary and beyond” Proc. OFC'99, 1999, vol. WM46-1, pp. 331—333.

[0005] An alternative coding scheme referred to as Phase-Shaped Binary Transmission (PSBT) has been described by Penninckx et al. in “The phase-shaped binary transmission (PSBT): a new technique to transmit far beyond the chromatic dispersion limit,” IEEE Photon. Technol. Lett., vol. 9, no. 2, pp. 259—261, February 1997.

[0006] The performance of such coding techniques may be accurately evaluated and compared via an analytical method recently proposed by one of the present inventors in E. Forestieri, “Evaluating the error probability in lightwave systems with chromatic dispersion, arbitrary pulse shape and pre- and post-detection filtering”, submitted to J. Lightwave Technol., vol.18, n.11, Nov.2000.

[0007] There is a need for a new line code that provides better performance than existing ones. The general purpose of the present invention is to obviate the above mentioned shortcomings by making available a line coding scheme, a method and an apparatus which would permit better performances then the prior art.

[0008] In view of this purpose it was sought to provide in accordance with the present invention a coding scheme of order n for digital communications for obtaining a coded signal x(t) which represents binary data which are constituted by sequences of information bits {u_(k)} with rate T, the scheme having N=2^(n) states, named Σ_(i), i=1,2, . . . , N, and comprising predetermined elementary signals s_(i)(t) which are combined in the signal x(t), characterized in that if at the time t=kT the coding is in a state Σ_(m) of the N states, the arrival of the information bit u_(k) of the sequence {u} forces a transition to the state Σ_(q) of the N states and the selection of the elementary signal s_(i)(t) as x(t), where q and i are given by the following equations:

d ₁ =m−1mod2

d ₀ =d ₁ +u _(k) mod2

r=2(m−1)+d ₀

q=(rmodN)+1 $i = \left\{ \begin{matrix} {r + 1} & {{{if}\quad r} < N} \\ {r - {2N}} & {otherwise} \end{matrix} \right.$

[0009] In accordance with an another aspect of the present invention, it was sought to provide the coding scheme in which the elementary signal s_(i)(t), i=±1,±2, . . . ,±N, are such that s_(−i)(t)=−s_(i)(t) and, for i≧1, in that: $\begin{matrix} {{s_{i}(t)} = \left\{ \begin{matrix} \begin{matrix} {\sum\limits_{k = 0}^{n}\quad {\left( {b_{k} - 0.5} \right){g\left( {t + {\left( {k - \frac{n + 1}{2}} \right)T}} \right)}}} & \quad \end{matrix} & {0 \leq t \leq T} \\ 0 & {otherwise} \end{matrix}\quad \right.} & \quad \end{matrix}$

[0010] where $\begin{matrix} {b_{k} = {\left\lbrack \frac{i - 1}{2^{k}} \right\rbrack \quad {mod}\quad 2}} & \quad & {{k = 0},1,\quad \ldots \quad,n} \end{matrix}$

[0011] and g(t) is a pulse of time length D=(n+1)T centered in the origin such that g(t)=g(−t) and having constant values over time intervals of length T/2.

[0012] Also, in accordance with the present invention, it was sought to provide a transmission method for coded digital communications, characterized in that the digital date are coded by the above mentioned coding scheme, and the coded signal is transmitted in a transmission means.

[0013] In accordance with the present invention, also it was sought to provide an apparatus for coded digital communications, characterized in that it comprises a coder for coding the digital date according to the coding scheme claimed.

[0014] To clarify the explanation of the innovative principles of the present invention and its advantages compared with the prior art there are described below with the aid of the annexed drawings possible embodiments thereof by way of non-limiting example applaying said principles. In the drawing:

[0015]FIG. 1 shows a state diagram and elementary signals according to a first embodiment of the present invention (order-1 code);

[0016]FIG. 2 shows a transmitter model configuration according to the present invention;

[0017]FIG. 3 shows a block diagram for a pre-amplified direct-detection optical system;

[0018]FIG. 4 shows example waveforms of prior art and novel line codes;

[0019]FIG. 5 shows the novel order-1 line code power spectrum at the encoder output for two values of the parameter α;

[0020]FIG. 6 shows an eye diagram for the known duobinary code;

[0021]FIG. 7 shows an eye diagram for the novel line code according to the invention in the case of order 1;

[0022]FIG. 8 shows a state diagram and elementary signals according to a second embodiment of the present invention (order-2 code);

[0023]FIG. 9 shows a state diagram according to a third embodiment (order-3 code).

[0024] With reference to the figures, FIG. 1 shows a state diagram and a set of elementary signals relating to a first embodiment of the invention in the case of order 1 code. As illustrated, the new line code uses four waveforms or elementary signals s_(i)(t), as shown in FIG. 1(a). It will be noted that the elementary signals form two pairs with one pair (e.g. s₁(t) and s₂(t)) being the negative of the second pair (i.e. s₄(t) and s₃(t) respectively). In addition two of the elementary signals (s₂(t) and s₃(t)), i.e. one form each pair are scaled by a factor α. The factor α will be chosen such as to produce the best spectral shape. The state diagram relating to this first line code according to the invention has two states, as shown in FIG. 1(b). The code states are denoted Σ₁, Σ₂ and the elementary signals are denoted s_(i)(t), i=1, 2, 3, 4.

[0025]FIG. 2 shows a transmitter apparatus according to the invention in which a source of information SOURCE feeding an encoder according to the present invention. The output x_(e)(t) of the encoder passes through low pass filter LPF to modulator MOD. FIG. 3 shows the entire apparatus making use of the transmission method according to the invention to send the digital information in a transmission means, in particular a means formed by optical fibers. The system comprises the transmitter of FIG. 2 (block TRANS), the optical fibre (singlemode type fibre) and the receiver. The receiver comprises, in sequence, an optical preamplifier with power gain G, an optical bandpass filter BPF, a detector (DETECTOR), a lowpass filter LPF and the sampler. The decoded transmitted information sequence {u_(k)} exits from the sampler output (SAMPLE). It will be noted that the code according to the invention don't need decoding because the elementary signals s_(i)(t) (signals that represent “zero's” and “one's” of the transmitted sequence) have quite different power at the moment of the fotodetection. Since the DETECTOR detects the power of the input signal, a simple threshold circuit is sufficient for distinguishing “zero's” and “one's”.

[0026] The information sequence{u_(k)} with rate T is encoded as shown in FIG. 3 to form the signal: $\begin{matrix} {{x_{e}(t)} = {\sum\limits_{k = {- \infty}}^{\infty}{{g_{1}\left( \sigma_{k} \right)}{s_{e}\left( {{t - {k\quad T}};u_{k}} \right)}}}} & (1) \end{matrix}$

[0027] where σ_(k) denotes the generic encoder state and g₁ (σ_(k)) is a coefficient which is defined by the following rule: $\begin{matrix} {{g_{1}\left( \sigma_{k} \right)} = \left\{ \begin{matrix} 1 & {if} & {\sigma_{k} = \Sigma_{1}} \\ {- 1} & {if} & {\sigma_{k} = \Sigma_{2}} \end{matrix} \right.} & (2) \end{matrix}$

[0028] where Σ₁ and Σ₂ indicate the states allowed to the encoder, and s_(e)(t;u_(k)) is one of the two elementary signals s₁(t) or s₂ (t) selected in accordance with the following rule: $\begin{matrix} {{s_{e}\left( {t;u_{k}} \right)} = \left\{ \begin{matrix} {s_{1}(t)} & {if} & {u_{k} = 0} \\ {s_{2}(t)} & {if} & {u_{k} = 1} \end{matrix} \right.} & (3) \end{matrix}$

[0029] Hence the elementary signal output from the encoder will be one of s₁(t) or s₂(t) or their negative (i.e. s₄(t) or s₃(t) respectively) depending on the value of g₁(σ_(k)), as shown in FIG. 1.

[0030] The sequence of states of the encoder is defined in the invention by the following rule:

σ_(k+1) =g ₂(u _(k), σ_(k))  (4)

[0031] where the value of the function g₂ to be used in the embodiment is described by the following map: $\begin{matrix} {u_{k}\backslash \sigma_{k}} & \Sigma_{1} & \Sigma_{2} \\ 0 & \Sigma_{1} & \Sigma_{2} \\ 1 & \Sigma_{2} & \Sigma_{1} \end{matrix}\quad$

[0032] An example of a waveform x_(e)(t) generated by the novel line code (with α=0.5) is shown in FIG. 4a togheter with, for comparison, signals generated with duobinary (FIG. 4b), PASS (FIG. 4c) and PSBT (FIG. 4d) codes of the prior art. The power spectral density of the signal x_(e)(t) in (1) coded according to the state diagram of FIG. 1 turns out to be: $\begin{matrix} {{G_{e}(f)} = {{\frac{1}{T}{{S_{1}(f)}}^{2}{\cos \quad}^{2}\pi \quad f\quad T} + {\frac{1}{T}{{S_{2}(f)}}^{2}{\sin \quad}^{2}\pi \quad f\quad T} + {j\frac{1}{T}{S_{1}(f)}{S_{2}^{*}(f)}\sin^{2}\pi \quad f\quad T}}} & (5) \end{matrix}$

[0033] where S₁(f) and S₂(f) are the Fourier transforms of the elementary signals s₁(t) and s₂(t), respectively.

[0034] The state diagram in FIG. 1(b) may be used in combination with any selection of elementary signals {S_(i)(t)}_(i = 1)⁴,

[0035] and the power spectral density in (5) holds as long as S₃(t)=−S2(t) and S₄(t)=−S1(t).

[0036] The choice of different elementary signal sets for s_(i)(t), i=1, 2, 3, 4 does not significantly affect the performance as long as a post-coder filter is adopted. For this reason we limit ourselves here to the set of elementary signals shown in FIG. 1(a).

[0037] A better understanding of the structure and characteristics of the order-1 code can be gained by expressing the form of the four elementary signals in FIG. 1 mathematically as linear combinations of rectangular pulses of duration T/2: $\begin{matrix} {{p(t)} = \left\{ \begin{matrix} 1 & {0 \leq t \leq {T/2}} \\ 0 & {elsewhere} \end{matrix} \right.} & \left( {6\quad a} \right) \end{matrix}$

[0038] In this case we get for the elementary signals s_(i)(t), i=1,2,3,4 the following expressions:

s ₁(t)=p(t)+p(t−T/2)

s ₂(t)=α[p(t)−p(t−T/2)]

s ₃ (t)=−s₂(t)

s ₄(t)=−s ₁(t)  (6b)

[0039] which will lead to an useful generalization in the case of the order-n code, as described below. When using (6a) we may also write G_(e)(f) in terms of P(f), the Fourier transform of p(t), as follows $\begin{matrix} {{G_{e}(f)} = {{\frac{1}{T}\left\lbrack {{\left( {1 + \alpha} \right)\cos \quad \pi \quad f\quad {T/2}} + {\left( {1 - \alpha} \right)\cos \quad 3\pi \quad f\quad {T/2}}} \right\rbrack}^{2}{{P(f)}}^{2}}} & \left( {7a} \right) \end{matrix}$

$\begin{matrix} {{P(f)} = {\frac{T}{2}\sin \quad {c\left( {f\quad {T/2}} \right)}^{{- j}\quad \pi \quad f\quad {T/2}}}} & \left( {7b} \right) \end{matrix}$

[0040] The power sprectrum is shown in FIG. 5 for two values of the parameter α. As can be seen, when increasing α the main lobe gets broader, but there is a stronger attenuation at the frequencies around 1/T and more energy is pushed in the Nyquist bandwidth. This behaviour has important consequence in selecting the best value of α Notice that espression (7a) per G_(e)(f) holds as long as s_(i)(t) are given by (6b) irrespectively of the actual shape of p(t), which may also be different from (6a), as already stated.

[0041] As described above with reference to FIG. 2, the signal x_(e)(t) in (1) is then lowpass filtered prior to driving the modulator. It will be seen later on that this low-pass filter has important effects on the overall performance.

[0042] In order to introduce the new order-n codes, we notice that, although the order-1 code is fully described by its diagram in FIG. 1, we may also envision its output signal x_(e)(t) in (1) as an equivalent PAM (Pulse Amplitude Modulated) signal, as follows $\begin{matrix} {{x_{e}(t)} = {\sum\limits_{k = {- \infty}}^{\infty}{w_{k}{g\left( {t - T - {k\quad T}} \right)}}}} & (8) \end{matrix}$

[0043] where (see FIG. 1c for a graph of g(t)) $\begin{matrix} {{g(t)} = {{\left( {1 - \alpha} \right){{rect}\left( \frac{t}{2\quad T} \right)}} + {2\quad \alpha \quad {rect}\quad \left( \frac{t}{T} \right)}}} & \left( {9a} \right) \end{matrix}$

$\begin{matrix} {{{rect}\quad \left( \frac{t}{T} \right)}\overset{\Delta}{=}\left\{ \begin{matrix} 1 & {{t} \leq {\tau/2}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {9b} \right) \end{matrix}$

[0044] and

w _(k) =b _(k)−0.5  (10)

[0045] where the precoded symbols b_(k) are obtained from the information symbols u_(k) by

b _(k) =u _(k−1) mod2  (11)

[0046] The encoder acts as if “large” output signals g(t) weighted by the coefficients wk were generated every T seconds, therefore overlapping each other to introduce a controlled amount of intersymbol interference. This interpretation is very useful because it allows to recognize that when the PAM pulse g(t) in (9a) is filtered by a Gaussian filter of bandwidth equal to ½T, the filter output fits very well a “prolate spheroidal wave function”, which, for a given time spread, has the most concentrated spectrum in frequency. This means that the filtered x_(e)(t) has a power spectral density the most concentrated in frequency and therefore is more robust to the chromatic dispersion. Indeed, it can be shown that a sufficiently dispersive fiber turns an input pulse s_(in)(t) with Fourier transform S_(in)(f) and bandwidth B_(in), into the output pulse envelope approximately given by $\begin{matrix} {{{{s_{out}(t)}} \approx {\frac{1}{T\sqrt{\pi \quad \gamma}}{{S_{i\quad n}\left( {- \frac{t}{{\pi\gamma}\quad T^{2}}} \right)}}\quad {for}\quad {\gamma \left( {\pi \quad B_{{i\quad n}\quad}T} \right)}^{2}}}\operatorname{>>}1} & (12) \end{matrix}$

[0047] where γ is the chromatic dispersion index of the fibre, defined as $\gamma = {\frac{D\quad \lambda^{2}}{\pi \quad c}R_{b}^{2}L}$

[0048] where c is the light speed, λ is the optical wavelength corresponding to the optical carrier frequency, D is the fibre chromatic dispersion parameter at λ (usually provided in ps/nm/ion), R_(b) is the bit rate and L is the fibre length. The above formula (12) turns out to be an exact relation instead that an approximation when the input pulse is properly chirped. So, the most concentrated in frequency the pulse, the less the effect of the intersymbol interference due to the chromatic dispersion in the output signal.

[0049] The signal y(t), corresponding to (1) or (8), at the output of the post-detection lowpass filter is of binary type and an example eye diagram corresponding to a 32-bit pattern with R_(b)=10 Gb/s, dispersive fibre of length L≈10 km and chromatic dispersion D=17 ps/nm/km at λ=1550 nm.

[0050] A corresponding eye diagram for duobinary/PSBT is shown in FIG. 7. Comparing the figures, it is evident the effectiveness of the novel line code according to the invention. It is evident that when γ increases, so does the time spread of s_(out)(t) in (12) and we reach a point where the intersymbol interference cannot be avoided any longer by the code of order 1. But observing that for γ′=2γ to the input pulse ${{s_{i\quad n}^{\prime}(t)} = {\frac{1}{\sqrt{2}}{s_{i\quad n}\left( {t/2} \right)}}},$

[0051] having the same energy of s_(in)(t), would correspond the same output pulse corresponding to s_(in)(t) at 1, we conclude that when the dispersion doubles we can still avoid intersymbol interference by using an equivalent PAM pulse of double duration (in this case, however, chirping may be required). The signal x_(e)(t) corresponding to an equivalent PAM pulse of length (n+1)T may be obtained by a coder of order n, as described below.

[0052] We now describe the general rule, embodiment of the coder of order n according to the present invention. As above disclose, a coder is described by its states, the transitions between states and the elementary signals correspondingly generated.

[0053] The order-n coder has N=2^(n) states, denoted by Σ_(i), i=1, 2, . . . , N, and the transitions and signal generations are specified by the following rule. If at the time t=kT the coder is in the state Σ_(m), the arrival of the information bit u_(k) forces a transition to the state Σ_(q) and the transmission of the elementary signal s_(i)(t), where q and i are given by the following equations: $\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {d_{1} = {m - {1\quad {mod}\quad 2}}} \\ {d_{0} = {d_{1} + {u_{k}\quad {mod}\quad 2}}} \end{matrix} \\ {r = {{2\left( {m - 1} \right)} + d_{0}}} \end{matrix} \\ {q = {\left( {r\quad {mod}\quad N} \right) + 1}} \end{matrix} \\ {i = \left\{ \begin{matrix} {r + 1} & {{{if}\quad r} < N} \\ {r - {2N}} & {otherwise} \end{matrix} \right.} \end{matrix} & \left( {13a} \right) \end{matrix}$

[0054] The elementary signals s_(i)(t), i=±1,∓2, . . . ,±N are such to form couples in which s_(−i)(t)=−s_(i)(t) and for i≧1 $\begin{matrix} {{s_{i}(t)} = \left\{ \begin{matrix} \begin{matrix} {\sum\limits_{k = 0}^{n}\quad {\left( {b_{k} - 0.5} \right){g\left( {t + {\left( {k - \frac{n + 1}{2}} \right)T}} \right)}}} & \quad \end{matrix} & {0 \leq t \leq T} \\ 0 & {otherwise} \end{matrix}\quad \right.} & \left( {13b} \right) \end{matrix}$

[0055] where $\begin{matrix} \begin{matrix} {b_{k} = {\left\lbrack \frac{i - 1}{2^{k}} \right\rbrack \quad {mod}\quad 2}} & \quad & {{k = 0},1,\ldots \quad,n} \end{matrix} & \left( {13c} \right) \end{matrix}$

[0056] and now g(t) is a pulse of time length D=(n+1)T centered in the origin such that g(t)=g(−t) and assuming piecewise constant values (chosen to produce the best spectral configuration) over time intervals of length T/2. To obtain the k-th information symbol the post-detection lowpass filter output signal y(t) is to be sampled at the time $t_{k} = {\left( {k + \frac{n}{2}} \right){T.}}$

[0057] It is obvious that the division in (13c) is a integer division.

[0058] Depending on the n-order used, the elementary signals s_(i)(t) obtained by the (13b) have characteristic independent from their particular shape. For example, in the above mentioned case of order-1, the signals named s₂(t) and s₃(t) in FIG. 1a (which form the couple s_(i)(t)=−s_(i)(t) in the general notation) must be shaped for having at least a change of sign in the middle point of the bit interval. Therefore, more different shapes of the elementary signals s_(i)(t) can be used in accordance with the principles of the present invention, that is following the coding scheme given by (13a), or any shape that can be obtaining with any type of filtering of the elementary signals s_(i)(t) obtained by (13b). In other words, s_(i)(t) obtained by (13b) can be filtered before coding.

[0059] Any couple of the elementary signals s_(i)(t) has level different than level of the other couples of the elementary signals s_(i)(t).

[0060] As another example of embodiment, a state diagram (FIG. 8b) and elementary signals (FIG. 5a: for simplicity, the four signals −s_(i)(t) are not shown) for a 4-state coder (order n=2) are shown in FIG. 8. Equivalent PAM pulse g(t) is shown in FIG. 8c.

[0061] Another example state diagram for a 8-state coder (order n=3) is shown in FIG. 9 (for simplicity, elementary signals and equivalent PAM pulse are not shown). In order to evaluate the performance of the line-coded pre-amplified direct-detection system shown in FIG. 2 and FIG. 3, we apply here the analysis presented in the paper by E. Forestieri referred to above as it poses no restrictions on the signal types and on the kind of the pre- and post-detection filters. In this manner, we have found that the best choice for the parameter α in (6b), according to invention, is α=0.5.

[0062] For highly dispersive fibres (γ>0.35), the most effective transmitter lowpass filter LPF in FIG. 2, is ideal of bandwidth equal to half the bit rate in the uncoded, duobinary and PASS case, while for the novel optical line code according to the invention the best filter turns out to be a Gaussian one with the same bandwidth. In this case, numerical results show that the novel line code performs better than all other coding schemes (among which the best are the narrow filtered duobinary and PSBT, whose performances are the same) as, given the same transmitted power (e.g. about 4 dBs more than that necessary for an uncoded transmission over a non-dispersive fibre), it allows to span a distance 1.5 times greater than that allowed by duobinary before the probability of bit error exceeds P_(b)=10⁻¹².

[0063] At this point, it is clear that the objectives of the present invention have been achieved by making a coding scheme having better performance than prior art schemes by means of a innovative state diagram and a particular selection of elementary signals.

[0064] Naturally the above description of embodiments applying the innovative principles of the present invention is given by way of non-limiting example of said principles within the scope of the exclusive right claimed here. For example it is clear for an expert in the art that the “bit 0” and “bit 1” indications used here can be exchanged to each other and the indexes used in the elementary waveform notation can be changed (for example, in FIG. 1a the indexes 1,2,3,4 can be 1,2,−1,−2, as obvious by the general case of order n). 

1. A coding scheme of order n for digital communications for obtaining a coded signal x(t) which represents binary data which are constituted by sequences of information bits {u_(k)} with rate T, the scheme having N=2^(n) states, named Σ_(i), i=1,2, . . . ,N, and comprising predetermined elementary signals s_(i)(t) which are combined in the signal x(t), characterized in that if at the time t=kT the coding is in a state Σ_(m) of the N states, the arrival of the information bit u_(k) of the sequence {u_(k)} forces a transition to the state Σ_(q) of the N states and the selection of the elementary signal s_(i)(t) as x(t), where q and i are given by the following equations: $\begin{matrix} {d_{1} = {m - {1\quad {mod}\quad 2}}} \\ {d_{0} = {d_{1} + {u_{k}\quad {mod}\quad 2}}} \\ {r = {{2\left( {m - 1} \right)} + d_{0}}} \\ {q = {\left( {r\quad {mod}\quad N} \right) + 1}} \\ {i = \left\{ \begin{matrix} {r + 1} & {{{if}\quad r} < N} \\ {r - {2N}} & {otherwise} \end{matrix} \right.} \end{matrix}$


2. Coding scheme as claimed in claim 1, characterized in that the elementary signal s_(i)(t), i=±1,±2, . . . ,±N, are such that s_(−i)(t)=−s_(i)(t) and, for i≧1, in that: $\begin{matrix} \quad & {{s_{i}(t)} = \left\{ \begin{matrix} {\sum\limits_{k = 0}^{n}{\left( {b_{k} - 0.5} \right){g\left( {t + {\left( {k - \frac{n + 1}{2}} \right)T}} \right)}}} & {0 \leq t \leq T} \\ 0 & {otherwise} \end{matrix} \right.} \\ {where} & \quad \\ \quad & \begin{matrix} {b_{k} = {\left\lbrack \frac{i - 1}{2^{k}} \right\rbrack \quad {mod}\quad 2}} & \quad & {{k = 0},1,\ldots \quad,n} \end{matrix} \end{matrix}$

and g(t) is a pulse of time length D=(n+1)T centered in the origin such that g(t)=g(−t) and having constant values over time intervals of length T/2.
 3. Coding scheme as claimed in claim 1, characterized in that the elementary signals s_(i)(t), i=±1,±2, . . . ,±N, constitute couples of signals s_(−i)(t)=−s_(i)(t), have levels not zero in a time interval of length T, and have levels zero elsewhere.
 4. Coding scheme as claimed in claim 3, characterized in that each couple of signals has level different from the level of the other couples of signals.
 5. Coding scheme as claimed in claim 4, characterized in that the level differences are choosen for producing the better spectral configuration.
 6. Coding scheme as claimed in claim 3, characterized in that the signals of one of the couples of the signals have a sign inversion in T/2.
 7. Coding scheme as claimed in claim 6, characterized in that the signals of said one of the couples of the signals have constant level over time intervals of length T/2.
 8. Coding scheme as claimed in claim 6, characterized in that almost when the order is n=1, an other of said couples of signals is constituted of a constant level pulse of length T.
 9. Coding scheme as claimed in claims 7 and 8, characterized in that the constant level of said one of couples of signals is less than the constant level of the other of said couples of signals.
 10. Coding scheme as claimed in claim 9, characterized in that the constant level of said one of couples of signals is equal to half of the constant level of the other of said couples of signals.
 11. Coding scheme as claimed in claim 2, characterized in that signals s_(i)(t) given by the equation (1) are filtered for resulting in elementary signal s_(i)(t) forming the x(t).
 12. Transmission method for coded digital communications, characterized in that the digital date are coded by the coding scheme claimed in anyone of the above mentioned claims, and the coded signal is transmitted in a transmission means.
 13. Transmission method as claimed in claim 12, characterized in that the transmission means are dispersive optical fibres.
 14. Apparatus for coded digital communications, characterized in that it comprises a coder for coding the digital date according to the coding scheme claimed in anyone of the above mentioned claims 1-11.
 15. Apparatus as claimed in claim 14, characterized in that the coded signal is transmitted in a transmission means.
 16. Apparatus as claimed in claim 15, characterized in that the transmission means are dispersive optical fibres.
 17. Apparatus as claimed in claim 15, characterized in that it comprises a lowpass filter between coder and transmission means.
 18. A coding method for a code of order n for digital communications to obtain a coded signal x(t) which represents binary data which are constituted by sequences of information bits {u_(k)} with rate T, the code having N=2^(n) states named Σ_(i), for i=1, 2, . . . , N, and predetermined elementary signals s_(i)(t) which are combined in the coded signal x(t), comprising the steps of: if, at the time t=kT, the code is in a state Σ_(m) of the N states, forcing a transition to the state Σ_(q) of the N states upon arrival of information bit u_(k) of the sequence of information bits {u_(k)}; and selecting the elementary signals s_(i)(t) as x(t), where q and i are given by the following equations: d _(l) =m−1mod2 d _(o) =d _(l) +u _(k) mod2 r=2(m−1 )+d_(o) q=(rmodN)+1 i=r+1 if r<N i=r−2N otherwise.
 19. The coding method as claimed in claim 18, in which the elementary signals s_(i)(t), for i=±1, ±2, . . . , ±N, are such that s⁻¹(t)=−s_(i)(t) and, for i≧1, in which: ${s_{i}(t)} = \left\{ \begin{matrix} {\sum\limits_{k = 0}^{n}{\left( {b_{k} - 0.5} \right){g\left( {t + {\left( {k - \frac{n + 1}{2}} \right)T}} \right)}}} & {0 \leq t \leq T} \\ 0 & {otherwise} \end{matrix} \right.$

where $\begin{matrix} {b_{k} = {\left\lbrack \frac{i - 1}{2^{k}} \right\rbrack \quad {mod}\quad 2}} & \quad & {{k = 0},1,\ldots \quad,n} \end{matrix}$

mod 2 k=0,1, . . . , n and g(t) is a pulse of time length D=(n+1) T centered in the origin such that g(t)=g (−t) and having constant values overf time intervals of length T/2.
 20. The coding method as claimed in claim 18, in which the elementary signals s_(i)(t), for i=±1, ±2, . . . , ±N, constitute couples of signals s_(i)(t)=−s_(i)(t), have levels not zero in a time interval of length T, and have levels zero elsewhere.
 21. The coding method as claimed in claim 20, in which each couple of the signals has a level different for the level of other couples of the signals.
 22. The coding method as claimed in claim 21, in which the level differences are chosen for improving the spectral configuration.
 23. The coding method as claimed in claim 20, in which the signals of one of the couples of the signals have a sign inversion in T/2.
 24. The coding method as claimed in claim 23, in which the signals of said one of the couples of the signals have constant level over time intervals of length T/2.
 25. The coding method as claimed in claim 23, in which, when the order is n=1, another of said couples of signals is constituted of a constant level pulse of length T.
 26. The coding method as claimed in claim 24, in which the constant level of said one of the couples of the signals is less than the constant level of the other of said couples of the signals.
 27. The coding method as claimed in claim 26, in which the constant level of said one of the couples of the signals is equal to half of the constant level of the other of said couples of the signals.
 28. The coding method as claimed in claim 19, in which the elementary signals s_(i)(t) are filtered for resulting in the elementary signals s_(i)(t) forming the x(t).
 29. A transmission method for a code of order n for coded digital communications to obtain a coded signal x(t) which represents binary data which are constituted by sequences of information bits {u_(k)} with rate T, the code having N=2^(n) states named Σ_(i), for i=1, 2, . . . , N, and predetermined elementary signals s_(i)(t) which are combined in the coded signal x(t), comprising the steps of: if, at the time t=kT, the code is in a state Σ_(m) of the N states, forcing a transition to the state Σ_(q) of the N states upon arrival of information bit u_(k) of the sequence of information bits {u_(k)}; and selecting the elementary signals s_(i)(t) as x(t), where q and i are given by the following equations: d _(l) =m−1mod2 d _(o) =d _(l) +u _(k) mod2 r=2(m−1)+d _(o) q=(rmodN)+1 i=r+1 if r<N i=r−2N otherwise; and transmitting the coded signal over a transmission means.
 30. The transmission method as claimed in claim 29, in which the transmission means are dispersive optical fibers.
 31. An apparatus for coded digital communications, comprising: a coder for coding digital data for a code of order n to obtain a coded signal x(t) which represents binary data which are constituted by sequences of information bits {u_(k)} with rate T, the code having N=2^(n) states named Σ_(i), for i=1, 2, . . . , N, and predetermined elementary signals s_(i)(t) which are combined in the coded signal x(t), comprising the steps of: if, at the time t=kT, the code is in a state Σ_(m) of the N states, forcing a transition to the state Σ_(q) of the N states upon arrival of information bit u_(k) of the sequence of information bits {u_(k)}; and selecting the elementary signals s_(i)(t) as x(t), where q and i are given by the following equations: d _(l) =m−1mod2 d _(o) =d _(l) +u _(k) mod2 r=2(m−1)+d _(o) q=(rmodN)+1 i=r+1 if r<N i=r−2N otherwise.
 32. The apparatus as claimed in claim 31, in which the coded signal is transmitted in a transmission means.
 33. The apparatus as claimed in claim 32, in which the transmission means are dispersive optical fibers.
 34. The apparatus as claimed in claim 32, in which a lowpass filter is provided between the coder and the transmission means. 